Model Elimination and Connection Tableau Procedures
نویسندگان
چکیده
منابع مشابه
Controlled Use of Clausal Lemmas in Connection TableauCalculiMarc
b b b b b b b b b b b b b b b b b b b Abstract Proof procedures based on model elimination or the connection tableau calculus have become more and more successful in the past. But these procedures still suuer from long proof lengths as well as from a rather high degree of redundant search eeort in comparison to resolution-style search procedures. In order to overcome these problems we investiga...
متن کاملTableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...
متن کاملThe Complexity of Automated Reasoning
This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the Davis-Putnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SL-resolution and the connection method are equivalent to restrictions of the improved tableau...
متن کاملAxiomatic and Tableau-Based Reasoning for Kt(H, R)
We introduce a tense logic, called Kt(H,R), arising from logics for spatial reasoning. Kt(H,R) is a multi-modal logic with two modalities and their converses defined with respect to a pre-order and a relation stable over this pre-order. We show Kt(H,R) is decidable, it has the effective finite model property and reasoning in Kt(H,R) is PSPACE-complete. Two complete Hilbert-style axiomatisations...
متن کاملSemi-analytic Tableaux For Propositional Modal Logics of Nonmonotonicity
The propositional monotonic modal logics K45, K45D, S4:2, S4R and S4F elegantly capture the semantics of many current nonmonotonic formalisms as long as (strong) de-ducibility of A from a theory ?; ? ` A; allows the use of necessitation on the members of ?: This is usually forbidden in modal logic where ? is required to be empty, resulting in a weaker notion of deducibility. Recently, Marek, Sc...
متن کامل